package com.contest;

import java.util.Arrays;

public class Solutioin1663 {
    public String getSmallestString(int n, int k) {
        char[] res = new char[n];
        Arrays.fill(res, 'a');
        k -= n;
        int i;
        for (i = n - 1; k > 25; k -= 25) {
            res[i--] = 'z';
        }
        res[i] = (char) (k + 'a');
        return String.valueOf(res);
    }
}
